Kan Extensions and Nonsensical Generalizations
نویسنده
چکیده
The categorical concept of Kan extensions form a more general notion of both limits and adjoints. The general definition of Kan extensions is given and motivated by several concrete examples. After providing the necessary background on some basic categorical objects and theorems, the relationship between Kan extensions, limits, and adjoints is expressed through two theorems from [3]. 1. Some Preliminary Categorical Concepts A tremendous array of fields within mathematics draws heavily upon the ideas of limits and adjoints. While these notions are sufficiently general for most uses, there exists a more abstract concept introduced by Kan [2], which encompasses both limits and adjoints. Although the following discussion assumes familiarity with the basic language of category theory, we begin by summarizing some terminology and a few results for reference and clarity. The notion of a limit is the first of these. Limits are easily understood through the auxiliary notion of a cone. Definition 1.1. Given a functor F : D → C, a cone on F is a pair (C, pD) consisting of: • an object C ∈ C, • a morphism pD : C → FD in C, for every object D ∈ D, such that for every morphism d : D → D′ in D, pD′ = Fd ◦ pD. The name “cone” is used for a reason; pictorially, cones are situations in which there are morphisms that take the object C to the objects FDi, with the following diagram commuting: C pD1 {{ww ww ww ww w pD2 (( Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q FD1 F (d) // FD2 ... FDi Definition 1.2. A limit of a functor is a universal cone. i.e. A limit of a functor F : D → C is a cone (L, (pD)D∈D) on F such that, for every cone (M, (qD)D∈D) on F, there exists a unique morphism m : M → L such that for every object D ∈ D, qD = pD ◦m. Kan extensions also generalize another important categorical structure: the adjunction.
منابع مشابه
Categories Enriched over a Quantaloid: Isbell Adjunctions and Kan Adjunctions
Each distributor between categories enriched over a small quantaloid Q gives rise to two adjunctions between the categories of contravariant and covariant presheaves, and hence to two monads. These two adjunctions are respectively generalizations of Isbell adjunctions and Kan extensions in category theory. It is proved that these two processes are functorial with infomorphisms playing as morphi...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملLeft Kan Extensions Over !-Cat
An existing procedure to compute left Kan extensions over the ground category Set also computes left Kan extensions over the ground categories Cat, 2-Cat, n-Cat for any n and indeed !-Cat. Therefore extension data struc-tured in this manner already can make use of the left Kan extension notion of a best possible approximation. Examples include systems of labeled transition systems and certain h...
متن کاملKan Extensions for Program Optimisation Or: Art and Dan Explain an Old Trick
Many program optimisations involve transforming a program in direct style to an equivalent program in continuation-passing style. This paper investigates the theoretical underpinnings of this transformation in the categorical setting of monads. We argue that so-called absolute Kan Extensions underlie this program optimisation. It is known that every Kan extension gives rise to a monad, the code...
متن کاملUsing Rewriting Systems to Compute Left Kan Extensions and Induced Actions of Categories
The aim is to apply string-rewriting methods to compute left Kan extensions, or, equivalently, induced actions of monoids, categories, groups or groupoids. This allows rewriting methods to be applied to a greater range of situations and examples than before. The data for the rewriting is called a Kan extension presentation. The paper has its origins in earlier work by Carmody and Walters who ga...
متن کامل